Turnpike Theorems for Integer Programming Problems
نویسندگان
چکیده
منابع مشابه
Turnpike Theorems for Convex Problems with Undiscounted Integral Functionals
In this paper the turnpike property is established for convex optimal control problems, involving undiscounted utility function and differential inclusions defined by multi-valued mapping having convex graph. Utility function is concave but not necessarily strictly concave. The turnpike theorem is proved under the main assumption that over any given line segment, either multi-valued mapping is ...
متن کاملA new approach for solving neutrosophic integer programming problems
Linear programming is one of the most important usages of operation research methods in real life, that includes of one objective function and one or several constraints which can be in the form of equality and inequality. Most of the problems in the real world are include of inconsistent and astute uncertainty, because of this reason we can’t obtain the optimal solution easily. In this paper, ...
متن کاملFiniteness Theorems in Stochastic Integer Programming
We study Graver test sets for families of linear multi-stage stochastic integer programs with varying number of scenarios. We show that these test sets can be decomposed into finitely many “building blocks”, independent of the number of scenarios, and we give an effective procedure to compute them. The paper includes an introduction to Nash-Williams’ theory of better-quasi-orderings, which is u...
متن کاملSensitivity theorems in integer linear programming
We consider integer linear programming problems with a fixed coefficient matrix and varying objective function and right-hand-side vector. Among our results, we show that, for any optimal solution to a linear program max{wx: Ax <~ b}, the distance to the nearest optimal solution to the corresponding integer program is at most the dimension of the problem multiplied by the largest subdeterminant...
متن کاملTwo sensitivity theorems in fuzzy integer programming
We consider the problem of estimating optima of covering integer linear programs with 0-1 variables under the following conditions: we do not know exact values of elements in the constraint matrix A but we know what elements of A are zero and what are nonzero, and also know minimal and maximal values of nonzero elements. We find bounds for variation of the optima of such programs in the worst a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Operations Research
سال: 1970
ISSN: 0030-364X,1526-5463
DOI: 10.1287/opre.18.3.432